package io.zhengsh.vvip.leetcode.dp;

public class Q583_delete_operation_for_two_strings {

    class Solution {
        public int minDistance(String word1, String word2) {
            int m = word1.length(), n = word2.length();
            int[][] dp = new int[m + 1][n + 1];
            for (int i = 1; i <= m; i++) {
                char c1 = word1.charAt(i - 1);
                for (int j = 1; j <= n; j++) {
                    char c2 = word2.charAt(j - 1);
                    if (c1 == c2) {
                        dp[i][j] = dp[i - 1][j - 1] + 1;
                    } else {
                        dp[i][j] = Math.max(dp[i - 1][j], dp[i][j - 1]);
                    }
                }
            }
            int lcs = dp[m][n];
            return m - lcs + n - lcs;
        }
    }
}
